A Chemical Graph Model Study of The Partition Coefficient of Halogenated Carbocompounds*
نویسنده
چکیده
A QSPR study of six sets of partition coefficients of a class of halogenated organic compounds has been performed with the aim to describe the six sets of partition coefficients with a common molecular connectivity descriptor, whose basic parameters can be derived by the aid of the three graph concepts: graph, pseudograph and complete graph. A simple odd complete graph conjecture gives rise to a set of four connectivity and pesudoconnectivity basis indices, which is, in fact, able to describe the six different cases of partition coefficients. This set of indices is, furthermore, the optimal set of indices for three cases. To underline are, also, the importance, as best single descriptor of the 1 v basis index, and the noticeable improvement the model undergoes when the only cis-compound is deleted from the model.
منابع مشابه
Application of Graph Theory: Relationship of Topological Indices with the Partition Coefficient (logP) of the Monocarboxylic Acids
It is well known that the chemical behavior of a compound is dependent upon the structure of itsmolecules. Quantitative structure – activity relationship (QSAR) studies and quantitative structure –property relationship (QSPR) studies are active areas of chemical research that focus on the nature ofthis dependency. Topological indices are the numerical value associated with chemical constitution...
متن کاملA new generalized model for predict speed of sound of refrigerants
In consideration of physical and chemical properties of pure substances, speed of sound is one of important quantity which can used to calculate many of other thermo-physical properties such as isothermal compressibility, Joule-Thomson coefficient, isobaric heat capacity and etc. These thermo-physical properties are the main parameters in industrial and chemical processes. Development of accura...
متن کاملThe upper domatic number of powers of graphs
Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...
متن کاملEXPERIMENTALl ANALYSIS OF PARTITION COEFFICIENT IN Al-Mg ALLOYS
Because the partition coefficient is one of the most important parameters affecting microsegregation, the aim of this research is to experimentally analyse the partition coefficient in Al-Mg alloys. In order to experimentally measure the partition coefficient, a series of quenching experiments during solidification were carried out. For this purpose binary Al-Mg alloys containing 6.7 and 10.2 w...
متن کامل